Relational Constructions on Semiconcept Graphs
نویسنده
چکیده
The aim of the paper is to develop a logic of relations on semiconcept graphs corresponding to the Contextual Logic of Relations on power context families. Semiconcept graphs allow the representation of negations. The operations from Peircean Algebraic Logic (i.e., the operations of relation algebras of power context families) are used to generate compound semiconcepts (or relations, resp.). For an arbitrary (semi-)concept graph, most specific semiconcept graphs are constructed where a compound semiconcept is assigned to each of the edges, i.e. compound semiconcepts are constructed directly on semiconcept graphs independent of the corresponding power context family.
منابع مشابه
Constructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملA graph distance metric combining maximum common subgraph and minimum common supergraph
The relationship between two important problems in pattern recognition using attributed relational graphs, the maximum common subgraph and the minimum common supergraph of two graphs, is established by means of simple constructions, which allow to obtain the maximum common subgraph from the minimum common supergraph, and vice versa. On this basis, a new graph distance metric is proposed for mea...
متن کاملStrongly polynomial sequences as interpretations
A strongly polynomial sequence of graphs (Gn) is a sequence (Gn)n∈N of finite graphs such that, for every graph F , the number of homomorphisms from F to Gn is a fixed polynomial function of n (depending on F ). For example, (Kn) is strongly polynomial since the number of homomorphisms from F to Kn is the chromatic polynomial of F evaluated at n. In earlier work of de la Harpe and Jaeger, and m...
متن کاملThe Word Problem in Semiconcept Algebras
The aim of this article is to prove that the word problem in semiconcept algebras is PSPACE-complete.
متن کاملOn the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کامل